Optimised Search Heuristics: A Mapping of Procedures and Combinatorial Optimisation Problems

Construction heuristics for hard combinatorial optimisation problems

A General Parallel Tabu Search Algorithm For Combinatorial Optimisation Problems ?

Tabu Search (TS) is a meta-heuristic search algorithm that is easy to parallelise. E cient parallelisation of TS can represent a signi cant saving in the real-time required to solve a problem over an equivalent sequential algorithm. In this study, a general parallel TS algorithm for solving combinatorial optimisation problems (COPs) is presented. The unique feature of our approach is that the T...

Stochastic Local Search Methods for Highly Constrained Combinatorial Optimisation Problems

Stochastic Local Search Methods for Highly Constrained Combinatorial Optimisation Problems

Multi-stage hyper-heuristics for optimisation problems

There is a growing interest towards self configuring/tuning automated general-purpose reusable heuristic approaches for combinatorial optimisation, such as, hyper-heuristics. Hyper-heuristics are search methodologies which explore the space of heuristics rather than the solutions to solve a broad range of hard computational problems without requiring any expert intervention. There are two commo...